A characterization of graphs G with nullity |V(G)|−2m(G)+2c(G)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the nullity of graphs

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. It is known that η(G) ≤ n − 2 if G is a simple graph on n vertices and G is not isomorphic to nK1. In this paper, we characterize the extremal graphs attaining the upper bound n− 2 and the second upper bound n− 3. The maximum nullity of simple graphs with n vertices and e edges, M(n, e), is al...

متن کامل

Ela on the Characterization of Graphs with Pendent Vertices and given Nullity∗

Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...

متن کامل

On the characterization of graphs with pendent vertices and given nullity

Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...

متن کامل

Ela on the Nullity of Graphs

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. It is known that η(G) ≤ n − 2 if G is a simple graph on n vertices and G is not isomorphic to nK1. In this paper, we characterize the extremal graphs attaining the upper bound n− 2 and the second upper bound n− 3. The maximum nullity of simple graphs with n vertices and e edges, M(n, e), is al...

متن کامل

A Note on the Nullity of Unicyclic Graphs

The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper we show the expression of the nullity and nullity set of unicyclic graphs with n vertices and girth r, and characterize the unicyclic graphs with extremal nullity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.09.034